Discriminating Lambda-Terms Using Clocked Boehm Trees
نویسندگان
چکیده
منابع مشابه
Discriminating Lambda-Terms Using Clocked Boehm Trees
As observed by Intrigila [16], there are hardly techniques available in the λ-calculus to prove that two λ-terms are not β-convertible. Techniques employing the usual Böhm Trees are inadequate when we deal with terms having the same Böhm Tree (BT). This is the case in particular for fixed point combinators, as they all have the same BT. Another interesting equation, whose consideration was sugg...
متن کاملModular Construction of Fixed Point Combinators and Clocked Boehm Trees
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of λ-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc’s), vastly generalizing the well-known fact that if Y is an fpc, Y (SI) is again an fpc, generating the Böhm sequence of fpc’s. Using the infinitary λ-calculus we devise infinitel...
متن کاملAn Introduction to the Clocked Lambda Calculus
We give a brief introduction to the clocked λ-calculus, an extension of the classical λ-calculus with a unary symbol τ used to witness the β-steps. In contrast to the classical λ-calculus, this extension is infinitary strongly normalising and infinitary confluent. The infinitary normal forms are enriched Lévy–Longo Trees, which we call clocked Lévy–Longo Trees. 1998 ACM Subject Classification D...
متن کاملAlmost Affine Lambda Terms
It is proved that a λ-term that has a negatively non-duplicated typing is always βη-equal to an almost affine λ-term.
متن کاملSeparability of Infinite Lambda Terms
Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2014
ISSN: 1860-5974
DOI: 10.2168/lmcs-10(2:4)2014